/****************
*PID:
*Auth:Jonariguez
*****************
*/
#define lson k*2,l,m
#define rson k*2+1,m+1,r
#define rep(i,s,e) for(i=(s);i<=(e);i++)
#define For(j,s,e) For(j=(s);j<(e);j++)
#define sc(x) scanf("%d",&x)
#define In(x) scanf("%I64d",&x)
#define SS(x,y) scanf("d",&x,&y)
#define pf(x) printf("%d",x)
#define pfn(x) printf("%d\n",(x))
#define Pf(x) printf("%I64d",(x))
#define Pfn(x) printf("%I64d\n",(x))
#define Pc printf(" ")
#define PY puts("YES")
#define PN puts("NO")
#define MP make_pair
#define X first
#define Y second
#define PI acos(-1.0)
#include <stdio.h>
#include <cstdio>
#include <string.h>
#include <string>
#include <math.h>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long LL;
typedef int Ll;
Ll quick_pow(Ll a,Ll b,Ll MOD){a%=MOD;Ll res=1;while(b){if(b&1)res=(res*a)%MOD;b/=2;a=(a*a)%MOD;}return res;}

const int maxn=100000+10;
const int MOD=1e9+7;

//char str[maxn];
string str;
string s;

int main()
{
    int i,j,n;
    while(getline(cin,str)){
        i=0;
        n=str.length();
        while(i<n && str[i]==' '){
            printf(" ");
            i++;
        }
        if(i>=n){
            puts("");continue;
        }
        while(i<n){
            j=i;
            while(j<n && str[j]!=' ') j++;
            int p=j-1;
            while(p>=i){
                printf("%c",str[p]);
                p--;
            }
            if(j>=n) break;
            p=j;
            while(p<n && str[p]==' '){
                printf(" ");
                p++;
            }
            if(p>=n) break;
            i=p;
        }
        puts("");
    }
    return 0;
}

